Eigendecomposition-Free Sampling Set Selection for Graph Signals
نویسندگان
چکیده
منابع مشابه
Spectral Domain Sampling of Graph Signals
Sampling methods for graph signals in the graph spectral domain are proposed. Conventional sampling of graph signals can be regarded as sampling in the graph vertex domain, but it does not have desired characteristics in regard to the graph spectral domain. Downand upsampled graph signals by using our methods inherit the frequency domain characteristics of sampled signals defined in the time/sp...
متن کاملTarget Set Selection in Dense Graph Classes
In this paper we study the Target Set Selection problem, a fundamental problem in computational social choice, from a parameterized complexity perspective. Here for a given graph and a threshold for each vertex the task is to find a set of active vertices that activates whole graph. A vertex becomes active if the number of activated vertices in its neighborhood is at least its threshold. We giv...
متن کاملStructured sampling and fast reconstruction of smooth graph signals
This work concerns sampling of smooth signals on arbitrary graphs. We first study a structured sampling strategy for such smooth graph signals that consists of a random selection of few pre-defined groups of nodes. The number of groups to sample to stably embed the set of k-bandlimited signals is driven by a quantity called the group graph cumulative coherence. For some optimised sampling distr...
متن کاملNetwork Sampling via Edge-based Node Selection with Graph Induction
In order to efficiently study the characteristics of network domains and support development of network systems (e.g. algorithms, protocols that operate on networks), it is often necessary to sample a representative subgraph from a large complex network. While prior research has shown that topological (e.g. random-walk based) sampling methods produce more accurate samples than approaches based ...
متن کاملAn Eigendecomposition Approach to Weighted Graph Matching Problems
Absfruct-This paper discusses an approximate solution to the weighted graph matching prohlem (WGMP) for both undirected and directed graphs. The W G M P is the problem of f inding the opt imum matching between two weighted graphs, which are graphs with weights at each arc. The proposed method employs an analytic, instead of a combinatorial or iterative, approach to the opt imum matching problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2019
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2019.2908129